Modular Specification and Verification of Dependable Distributed Protocols
نویسنده
چکیده
In this paper, a framework utilizing constructs from category theory for compositional specification of dependable distributed protocols has been proposed. The paper shows how by defining external interfaces of basic modules, and functional mappings linking two different modules, a larger or more complex protocol can be composed and verified. To illustrate the proposed approach, the compositional specification of a transaction processing protocol has been presented. Specifically, how the overall global properties of the protocol can be proved by utilizing proof constructs of local subproperties of the inherent building-blocks of the dependable distributed protocol has been illustrated. A tool-assisted modular specification and verification of three-phase commit protocol is also presented.
منابع مشابه
Web Service Choreography Verification Using Z Formal Specification
Web Service Choreography Description Language (WS-CDL) describes and orchestrates the services interactions among multiple participants. WS-CDL verification is essential since the interactions would lead to mismatches. Existing works verify the messages ordering, the flow of messages, and the expected results from collaborations. In this paper, we present a Z specification of WS-CDL. Besides ve...
متن کاملCompositional Approach to Verification of Distributed System Protocols
Distributed system protocols exhibit complex behavior due to concurrent and asynchronous computation in a decentralized environment. Verification of such protocols is known as notoriously difficult. Model checking is one of the techniques that have been successfully applied in verification of real life protocols. However, model checking suffers from a state explosion problem when dealing with f...
متن کاملAn Approach to Simplifying Formal Veri cations of Protocols through Identi cation of Modular Blocks in Redundancy Management Protocols
Dependable system designs typically use redundant resources and redundancy management protocols to deliver reliable and timely services. For such systems, a considerable eeort gets expended in ascertaining the correctness of the system operations. In recent years, formal methods have been extensively used for proving the correctness of fault-tolerant system design and implementation 5]. We have...
متن کاملProgramming Language Abstractions for Modularly Verified Distributed Systems
Distributed systems are rarely developed as monolithic programs. Instead, like any software, these systems may consist of multiple program components, which are then compiled separately and linked together. Modern systems also incorporate various services interacting with each other and with client applications. However, state-of-the-art verification tools focus predominantly on verifying stand...
متن کاملCoqIOA: A Formalization of IO Automata in the Coq Proof Assistant
Implementing distributed systems correctly is difficult. Designing correct distributed systems protocols is challenging because designs must account for concurrent operation and handle network and machine failures. Implementing these protocols is challenging as well: it is difficult to avoid subtle bugs in implementations of complex protocols. Formal verification is a promising approach to ensu...
متن کامل